Global Caching, Inverse Roles and Fixpoint Logics
نویسنده
چکیده
I will begin by explaining an optimal tableau-based algorithm for checking ALC-satisfiability which uses “global caching” and which appears to work well in practice. The algorithm settles a conjecture that “global caching can lead to optimality”. I will then explain how “global caching” can be extended to “global state caching” for inverse roles, thereby extending the result to ALCI-satisfiability, and converse roles in general. Finally, I will explain how “global caching” can be used to give optimal “on the fly” tableau decision procedures for some fixpoint logics. Finally, some open questions. The talk is intended to be expository so it will be at a fairly high level.
منابع مشابه
Tableau-based Reasoning for Description Logics with Inverse Roles and Number Restrictions
Tableau-based Reasoning for Description Logics with Inverse Roles and Number Restrictions Yu Ding, Ph.D. Concordia University, 2008 The tableaux algorithm is a general technique for deciding concept satisfiability problems in description logics (DLs). It is useful not only for practical implementations, but also for studying the correctness and complexity of concrete decision procedures. There ...
متن کاملEXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies
The description logic SHI extends the basic description logic ALC with transitive roles, role hierarchies and inverse roles. The known tableau-based decision procedure [9] for SHI exhibit (at least) NEXPTIME behaviour even though SHI is known to be EXPTIME-complete. The automata-based algorithms for SHI often yield optimal worst-case complexity results, but do not behave well in practice since ...
متن کاملTableau Caching for Description Logics with Inverse and Transitive Roles
Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicability of some well-known optimization techniques, especially the one for caching the satisfiability status of modal successors. In this paper, we present a rule synthesis technique from which an estimation of the potential back-...
متن کاملTowards Efficient Reasoning for Description Logics with Inverse Roles
This paper presents a first proposal for improving the efficiency of modern description logic (DL) reasoners that are known to be less efficient for DLs with inverse roles. The current loss of performance is usually caused by the missing applicability of well-known optimization techniques such as caching the satisfiability status of modal successors. In order to improve this situation we propos...
متن کاملReasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees
In the last years, the investigation on Description Logics (DLs) has been driven by the goal of applying them in several areas, such as, software engineering, information systems, databases, information integration, and intelligent access to the web. The modeling requirements arising in the above areas have stimulated the need for very rich languages, including fixpoint constructs to represent ...
متن کامل